Two - Level Adaptive Multiple Branch Prediction Using a Global History
نویسندگان
چکیده
We propose an enhanced multiple branch predictor using per-primary address branch histories. Using this scheme, the interferences among diierent branches are reduced, enhancing the average prediction accuracy. Also, since the branches predicted each cycle do not suuer from successive dependencies, predictions are generated in parallel. This scheme results in higher average branch prediction accuracy than the previous global history scheme under the same implementation cost. For two branch predictions, the prediction accuracy of integer benchmarks varies between 92.0 and 96.9 percent. For oating point benchmarks including nasa7, the accuracy is between 94.8 and 95.8 percent .
منابع مشابه
An Enhanced Two-Level Adaptive Multiple Branch Prediction for Superscalar Processors
This paper proposes an enhanced method of multiple branch prediction using a per-primary branch history table. This scheme improves the previous ones based on a single global branch history register, by reducing interferences among histories of diierent branches caused by sharing a single register. This scheme also allows the prediction of a branch not to aaect the prediction of other branches ...
متن کاملApplying Caching to Two-Level Adaptive Branch Prediction
During the 1990s Two-level Adaptive Branch Predictors were developed to meet the requirement for accurate branch prediction in high-performance superscalar processors. However, while two-level adaptive predictors achieve very high prediction rates, they tend to be very costly. In particular, the size of the second level Pattern History Table (PHT) increases exponentially as a function of histor...
متن کاملThe Cascaded Predictor: Economic and Adaptive Branch Target Prediction
Two-level predictors improve branch prediction accuracy by allowing predictor tables to hold multiple predictions per branch. Unfortunately, the accuracy of such predictors is impaired by two detrimental effects. Capacity misses increase since each branch may occupies entries proportional to the number of different path histories leading up to the branch. The working set of a given program ther...
متن کاملBranch Prediction using Advanced Neural Methods
Among the hardware techniques, two-level adaptive branch predictors with two-bit saturating counters are acknowledged as best branch predictors. They accomplish very competitive performance at low hardware cost. However, with the rapid of evolution of superscalar processors, the more accurate predictors are desired for more correct branch prediction as one of speculation method. They will lead ...
متن کاملAlternative Implementations of Two - Level Adaptive Branch
As the issue rate and depth of pipelining of high performance Superscalar processors increase, the importance of an excellent branch predictor becomes more vital to delivering the potential performance of a wide-issue, deep pipelined microarchitecture. We propose a new dynamic branch predictor (Two-Level Adaptive Branch Prediction) that achieves substantially higher accuracy than any other sche...
متن کامل